Constructive and computable Hahn–Banach theorems for the (second) fundamental theorem of welfare economics
نویسنده
چکیده
The Hahn–Banach Theorem plays a crucial role in the second fundamental theorem of welfare economics. To date, all mathematical economics and advanced general equilibrium textbooks concentrate on using non-constructive or incomputable versions of this celebrated theorem. In this paper we argue for the introduction of constructive or computable Hahn–Banach theorems in mathematical economics and advanced general equilibrium theory. The suggested modification would make applied and policyoriented economics intrinsically computational. © 2014 Elsevier B.V. All rights reserved.
منابع مشابه
On the Borel Complexity of Hahn-Banach Extensions
The classical Hahn-Banach Theorem states that any linear bounded functional defined on a linear subspace of a normed space admits a norm-preserving linear bounded extension to the whole space. The constructive and computational content of this theorem has been studied by Bishop, Bridges, Metakides, Nerode, Shore, Kalantari, Downey, Ishihara and others and it is known that the theorem does not a...
متن کاملComputability of Banach Space Principles
We investigate the computable content of certain theorems which are sometimes called the “principles” of the theory of Banach spaces. Among these the main theorems are the Open Mapping Theorem, the Closed Graph Theorem and the Uniform Boundedness Theorem. We also study closely related theorems, as Banach’s Inverse Mapping Theorem, the Theorem on Condensation of Singularities and the BanachStein...
متن کاملA FUZZY VERSION OF HAHN-BANACH EXTENSION THEOREM
In this paper, a fuzzy version of the analytic form of Hahn-Banachextension theorem is given. As application, the Hahn-Banach theorem for$r$-fuzzy bounded linear functionals on $r$-fuzzy normedlinear spaces is obtained.
متن کاملEffective Choice and Boundedness Principles in Computable Analysis
In this paper we study a new approach to classify mathematical theorems according to their computational content. Basically, we are asking the question which theorems can be continuously or computably transferred into each other? For this purpose theorems are considered via their realizers which are operations with certain input and output data. The technical tool to express continuous or compu...
متن کاملHow Incomputable is the Separable Hahn-Banach Theorem?
We determine the computational complexity of the Hahn-Banach Extension Theorem. To do so, we investigate some basic connections between reverse mathematics and computable analysis. In particular, we use Weak König’s Lemma within the framework of computable analysis to classify incomputable functions of low complexity. By defining the multi-valued function Sep and a natural notion of reducibilit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015